CHARACTERIZATIONS OF BOOLEAN RANK PRESERVERS OVER BOOLEAN MATRICES

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Boolean Matrices . . . Neither Boolean nor Matrices

Boolean matrices, the incidence matrices of a graph, are known not to be the (universal) matrices of a Boolean algebra. Here, we also show that their usual composition cannot make them the matrices of any algebra. Yet, later on, we “show” that it can. This seeming paradox comes from the hidden intrusion of a widespread set-theoretical (mis) definition and notation and denies its harmlessness. A...

متن کامل

Omega-almost Boolean rings

In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.

متن کامل

Euclidean and circum-Euclidean distance matrices: Characterizations and linear preservers

Short proofs are given to various characterizations of the (circum-)Euclidean squared distance matrices. Linear preserver problems related to these matrices are discussed.

متن کامل

Minimization Over Boolean Graphs

This paper presents a systematic procedure for the design of gate-type combinational switchingcircuitswithoutdiredtedloops. Eachsuchcircuit(Boo1eangraph) is in correspondencewithasequence of decompositions of the Boolean function which it realizes. A general approach to functional decomposition i s given and, in terms of a convenient positional representation, efficient tests for the detection ...

متن کامل

Quantifying over boolean announcements

Various extensions of public announcement logic have been proposed with quantification over announcements. The best-known extension is called arbitrary public announcement logic, APAL. It contains a primitive language construct ✷φ intuitively expressing that “after every public announcement of a formula, formula φ is true.” The logic APAL is undecidable and it has an infinitary axiomatization. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Pure and Applied Mathematics

سال: 2014

ISSN: 1226-0657

DOI: 10.7468/jksmeb.2014.21.2.121